package java11;

import java.util.Scanner;

/**
 * @author 兴趣使然黄小黄
 * @version 1.0
 * @date 2023/4/17 11:16
 * 最小公倍数
 */
public class Main {
    public static void main(String[] args) {
        Scanner console = new Scanner(System.in);
        int m = console.nextInt();
        int n = console.nextInt();
        int result = getCM(m, n);
        System.out.println(result);
    }

    // 最小公倍数 = num1 * num2 / 最大公因数
    public static int getCM(int m, int n){
        return m * n / gcd(m, n);
    }

    // 辗转相除法求 m n 的最大公因数
    private static int gcd(int m, int n) {
        // 2 6 2  6 2 0
        int o = m % n;
        while (o != 0) {
            m = n;
            n = o;
            o = m % n;
        }
        return n;
    }
}